More polytopes meeting the conjectured Hirsch bound
نویسندگان
چکیده
منابع مشابه
More polytopes meeting the conjectured Hirsch bound
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n ? d. Recently Holt and Klee constructed polytopes which meet this bound for a number of (d; n) pairs with d 13 and for all pairs (14; n). These constructions involve a judicious use of truncation, wedging, and blending on polytopes which already meet the Hirsch bound. In this paper we extend these te...
متن کاملSimplex Methods Meeting the Conjectured Hirsch
In 1957, Hirsch conjectured that every d−polytopes with n facets has edge-diameter at most n − d. Recently Holt and Klee constructed polytopes which meet this bound for a number of (d, n) pairs with d ≤ 13 and for all pairs (14, n). The main purpose of this paper is to present linear Hirsch bound ⌊ 2 ⌋+ d− 2 for all pairs (d, n) and to review mathematical ideas behind simplex methods, investiga...
متن کاملAn Upper Bound Theorem concerning lattice polytopes
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of integrally closed lattice polytopes. Finally we apply our results for reflexive integrally closed and order polytopes.
متن کاملDivisibility of Codes Meeting the Griesmer Bound
The brackets of ``[n, k, d]'' signal that C is linear, and n is the length, k the dimension, and d the minimum weight of C. The bound was proved by Griesmer in 1960 for q=2 and generalized by Solomon and Stiffler in 1965. Over the years, much effort has gone into constructing codes meeting the bound or showing, for selected parameter values, that they do not exist. This effort is part of the mo...
متن کاملOn codes meeting the Griesmer bound
We investigate codes meeting the Griesmer bound. The main theorem of this article is the generalization of the nonexistence theorem of [7] to a larger class of codes. keywords: Griesmer bound, extending codes, nonexistence theorem, code construction
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00017-5